Genetic Algorithm with adaptive elitist-population strategies for multimodal function optimization
نویسندگان
چکیده
This paper introduces a new technique called adaptive elitist-population search method. This technique allows unimodal function optimization methods to be extended to efficiently explore multiple optima of multimodal problems. It is based on the concept of adaptively adjusting the population size according to the individuals’ dissimilarity and a novel direction dependent elitist genetic operators. Incorporation
منابع مشابه
Adaptive Elitist-Population Based Genetic Algorithm for Multimodal Function Optimization
This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently locate all optima of multimodal problems. The technique is based on the concept of adaptively adjusting the population size according to the individuals’ dissimilarity and the novel elitist genetic operators. Incorporation of the...
متن کاملAirfoil Shape Optimization with Adaptive Mutation Genetic Algorithm
An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...
متن کاملAdaptive Diversity of Genetic Algorithm for QoS-based Cloud Service Selection
An elitist selection adaptive Genetic Algorithm is presented to select an optimal cloud service composite plan from a lot of composite plans on the basis of global Qualityof-Service (QoS) constraints. In this Algorithm, some strategies are provided to improve convergence and population diversity and raise fitness result. These strategies include an elitist selection strategy, an individual sele...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملA Clearing Procedure as a Niching Method for Genetic Algorithms
The clearing procedure is a niching method inspired by the principle stated by J.H. Holland in 1975: the sharing of limited resources within subpopulations of individuals characterized by some similarities. But, instead of evenly sharing the available resources among the individuals of a subpopulation, the clearing procedure supplies these resources only to the best individuals of each subpopul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Soft Comput.
دوره 11 شماره
صفحات -
تاریخ انتشار 2011